Time to Leave the Trees: From Syntactic to Conceptual Querying of XML
نویسندگان
چکیده
Current XML query languages operate on XML instances only but ignore valuable conceptual level information that is “buried” inside complex XML Schema documents. For example, XPath queries are evaluated against XML documents based on element names (tags) and their syntactic nesting structure, ignoring the element types and other conceptual level information that is declared in separate XML schemas. We propose an extension to XML query languages for conceptual querying of XML, based on an underlying abstract model of XML Schema (MXS). We show that this approach offers the user new and often more adequate high-level query capabilities beyond the traditional purely syntactic approach of querying XML trees.
منابع مشابه
Time to Leave the Trees : From
Current XML query languages operate on XML instances only but ignore valuable conceptual level information that is \buried" inside complex XML Schema documents. For example, XPath queries are evaluated against XML documents based on element names (tags) and their syntactic nesting structure, ignoring the element types and other conceptual level information that is declared in separate XML schem...
متن کاملAn Approach for Model Querying-by-Example Applied to Multi- Paradigm Models
Scenarios for industry-scale multi-paradigm modelling involve analysis, transformation, or fine-grained manipulation of models. These models are often treated wholly or in part as trees (e.g. XML or XMI documents, or source code). However, existing facilities for accessing and manipulating models as trees is limited. We present a novel approach to model querying-by-example, treating models as t...
متن کاملLearning Monadic Queries for Semi-Structured Documents from Positive Examples
Querying for nodes in trees is a core operation for information extraction from semi-structured documents in XML or HTML. We show that regular monadic queries for nodes in trees can be identified from positive examples, and this in polynomial time when represented by deterministic node selecting transducers that we introduce.
متن کاملQuerying Streaming XML Data Using Hash-Lookup Query Trees
The rapid growth in the amount of XML data and the development of publish-subscribe systems have led to great interest in processing streaming XML data. While a number of efficient systems have been developed to process XPath filters on XML streams, the performance of existing systems that query streaming XML data is inadequate. We propose the QstreamX system for querying streaming XML data usi...
متن کاملQuery Evaluation on Compressed Trees
This paper studies the problem of evaluating unary (or nodeselecting) queries on unranked trees compressed in a natural structure-preserving way, by the sharing of common subtrees. The motivation to study unary queries on unranked trees comes from the database field, where querying XML documents, which can be considered as unranked labelled trees, is an important task. We give algorithms and co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002